Embedding odometers in cellular automata

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding Odometers in Cellular Automata

We consider the problem of embedding odometers in one-dimensional cellular automata. We show that (1) every odometer can be be embedded in a gliders with reflecting walls cellular automaton, which one depending on the odometer, and (2) an odometer can be embedded in a cellular automaton with local rule xi 7→ xi + xi+1 mod n (i ∈ Z), where n depends on the odometer, if and only if it is “finitary.”

متن کامل

Prevalence of Odometers in Cellular Automata

We consider left permutive cellular automata Φ with no memory and positive anticipation, defined on the space of all doubly infinite sequences with entries from a finite alphabet. For each such automaton that is not one-to-one, there is a dense set of points x, which is large in another sense too, such that Φ : cl{Φn(x) : n ≥ 0} → cl{Φn(x) : n ≥ 0} is topologically conjugate to an odometer, the...

متن کامل

The spatial structure of odometers in certain cellular automata

Recent work has shown that many cellular automata (CA) have configurations whose orbit closures are isomorphic to odometers. We investigate the geometry of the spacetime diagrams of these ‘odometer configurations’. For boolean linear CA, we exactly determine the positions of the consecutive ‘gears’ of the odometer mechanism in the configuration. Then we characterize and explain the self-similar...

متن کامل

Embedding Bratteli-vershik Systems in Cellular Automata *

Many dynamical systems can be naturally represented as Bratteli-Vershik (or adic) systems, which provide an appealing combinatorial description of their dynamics. If an adic system X satisfies two technical conditions (focus and bounded width) then we show how to represent X using a two-dimensional subshift of finite type Y ; each ‘row’ in a Y -admissible configuration corresponds to an infinit...

متن کامل

Embedding Cellular Automata into Reversible Ones

To oli showed that every cellular automaton of an arbitrary dimension d can be embedded into a reversible cellular automaton of dimension d+1. He asked \whether an arbitrary cellular automaton can be embedded in a reversible one having the same number of dimensions" and conjectured that this is not possible. We show that his conjecture is true. Even if one imposes only a weak, natural condition...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Fundamenta Mathematicae

سال: 2009

ISSN: 0016-2736,1730-6329

DOI: 10.4064/fm206-0-8